Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
151	Constraint Satisfaction with Counting Quantifiers⋆ Florent Madelaine1 , Barnaby Martin2⋆⋆ and Juraj Stacho3⋆ ⋆ ⋆ 2 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-03-15 13:21:54 Computational complexity theory Logic Complexity classes Abstraction Metalogic Predicate logic Finite model theory IP FO Quantifier PSPACE-complete Model theory
152	Quantified Constraints on Directed Graphs Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract We study the quantified H-colou Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:50 Graph theory Mathematics Discrete mathematics NP-complete problems Morphisms Graph coloring Graph homomorphism Degree Line graph
153	Max-Min Relations in Combinatorial Optimization Jos´e Soto October 6, 2010 Max-Min Relations in Combinatorial Optimization Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2013-08-08 17:44:22 Graph theory Mathematics NP-complete problems Bipartite graph Parity Matching Perfect graph Vertex cover
154	A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs Mohammed Amin Abdullah∗‡ Nikolaos Fountoulakis†‡ Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2014-12-03 11:53:57 Graph theory Graph coloring NP-complete problems Incidence coloring
155	CS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory Tim Roughgarden & Gregory Valiant∗ May 2, 2016 Spectral graph theory is the powerful and beautiful theory that arises from the following Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Graph theory Mathematics Algebra Algebraic graph theory Matrix theory Matrices NP-complete problems Laplacian matrix Eigenvalues and eigenvectors Regular graph Spectral clustering Graph partition
156	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
157	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:03 Graph theory NP-complete problems Combinatorial optimization Planar graphs Dominating set Matching Graph coloring Maximal independent set
158	Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:37:00 Graph theory NP-complete problems Graph Graph coloring Planar graph Dominating set Connectivity Graph operations Planar separator theorem
159	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching
160	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-12-14 14:46:08 NP-complete problems Circular-arc graph Longest path problem Hamiltonian path Interval graph Intersection graph Independent set Graph theory Pathwidth Trapezoid graph

UPDATE